A Hierarchy of Mildly Context-Sensitive Dependency Grammars

نویسندگان

  • Anssi Yli-Jyrä
  • Matti Nykänen
  • Gerhard Jäger
  • Paola Monachesi
چکیده

The paper presents Colored Multiplanar Link Grammars (CMLG). These grammars are reducible to extended right-linear S-grammars (Wartena 2001) where the storage type S is a concatenation of c pushdowns. The number of colors available in these grammars induces a hierarchy of Classes of CMLGs. By fixing also another parameter in CMLGs, namely the bound t for non-projectivity depth, we get c-Colored t-Non-projective Dependency Grammars (CNDG) that generate acyclic dependency graphs. Thus, CNDGs form a two-dimensional hierarchy of dependency grammars. A part of this hierarchy is mildly context-sensitive and non-projective. 11.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mildly Non-Projective Dependency Grammar

Syntactic representations based on word-to-word dependencies have a long tradition in descriptive linguistics, and receive considerable interest in many computational applications. However, dependency syntax has remained somewhat of an island from a formal point of view, which hampers the exchange of resources and computational methods with other syntactic traditions. In this article, we presen...

متن کامل

Mildly Context-Sensitive Languages via Buffer Augmented Pregroup Grammars

A family of languages is called mildly context-sensitive if – it includes the family of all -free context-free languages; – it contains the languages • {anbncn : n ≥ 1} – multiple agreement, • {ambncmdn : m,n ≥ 1} – crossed dependencies, and • {ww : w ∈ Σ+} – reduplication; – all its languages are semi-linear; and – their membership problem is decidable in polynomial time. In our paper we intro...

متن کامل

Polynomial Pregroup Grammars parse Context Sensitive Languages

Pregroup grammars with a possibly infinite number of lexical entries are polynomial if the length of type assignments for sentences is a polynomial in the number of words. Polynomial pregroup grammars are shown to generate the standard mildly context sensitive formal languages as well as some context sensitive natural language fragments of Dutch, SwissGerman or Old Georgian. A polynomial recogn...

متن کامل

Dependency Structure Grammars

In this paper, we define Dependency Structure Grammars (DSG), which are rewriting rule grammars generating sentences together with their dependency structures, are more expressive than CF-grammars and non-equivalent to mildly context-sensitive grammars. We show that DSG are weakly equivalent to Categorial Dependency Grammars (CDG) recently introduced in [6, 3]. In particular, these dependency g...

متن کامل

Derivational Minimalism Is Mildly Context-Sensitive

The change within the linguistic framework of transformational grammar from GB–theory to minimalism brought up a particular type of formal grammar, as well. We show that this type of a minimalist grammar (MG) constitutes a subclass of mildly context–sensitive grammars in the sense that for each MG there is a weakly equivalent linear context–free rewriting system (LCFRS). Moreover, an infinite h...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005